Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
author
Abstract:
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality conditions are obtained for efficient and properly efficient solutions. Some duality results are established for multiobjective Schaible type dual. Keywords: Nonlinear Programming, Multi-Objective Fractional Programming, Semilocally Convex Functions, Pseudoconvex Functions.
similar resources
DUALITY FOR NONLINEAR FRACTIONAL PROGRAMMING INVOLVING GENERALIZED ρ-SEMILOCALLY b-PREINVEX FUNCTIONS
We consider a nonlinear fractional programming problem with inequality constraints, where the functions involved are ρ-semilocally b-preinvex, ρ-semilocally explicitly b-preinvex, ρ-semilocally quasi b-preinvex, ρ-semilocally pseudo bpreinvex and ρ-semi-locally strongly pseudo b-preinvex functions. Necessary optimality conditions are obtained in terms of the right derivative of a function along...
full textOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
full textOptimality Criteria and Duality in Multiobjective Programming Involving Nonsmooth Invex Functions
Abstract. In this paper a generalization of invexity is considered in a general form, by means of the concept of K-directional derivative. Then in the case of nonlinear multiobjective programming problems where the functions involved are nondifferentiable, we established sufficient optimality conditions without any convexity assumption of the K-directional derivative. Then we obtained some dual...
full textDuality for multiobjective fractional programming problem using convexifactors
In this paper, the concept of ∂-quasiconvexity is introduced by using convexifactors. Mond-Weir-type and Schaible-type duals are associated with a multiobjective fractional programming problem, and various duality results are established under the assumptions of ∂-pseudoconvexity and ∂-quasiconvexity.
full textSufficiency and duality in multiobjective fractional programming problems involving generalized type I functions
*Correspondence: [email protected] Chung-Jen Junior College of Nursing, Health Sciences and Management, Dalin, 62241, Taiwan Abstract In this paper, we establish sufficient optimality conditions for the (weak) efficiency to multiobjective fractional programming problems involving generalized (F,α,ρ ,d)-V-type I functions. Using the optimality conditions, we also investigate a parametric-type dua...
full textMy Resources
Journal title
volume 2 issue None
pages 0- 0
publication date 2012-09
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023